Routing and Clustering in Schema-Based Super Peer Networks

نویسندگان

  • Wolfgang Nejdl
  • Wolf Siberski
  • Martin Wolpers
  • Christoph Schmitz
چکیده

Peer-to-Peer networks have evolved from simple approaches like Napster (using a central index) and Gnutella (using simple broadcasting of queries) to more sophisticated approaches using distributed indices like DHTs [7], [9] or super peer networks [10]. These systems which allow to describe content with metadata assume homogeneous content/metadata; metadata schemas are fixed in advance for all participating peers. This is a useful assumption when all peers share the same type of content, but restrictive in more heterogeneous settings based on distributed information providers. In this position paper we will investigate P2P networks of more sophisticated peers, which provide and use explicit (typically heterogeneous) schema descriptions of their content. We will start by giving a short overview over schema-based P2P networks. We will then discuss how this additional schema information can be used for routing and clustering in such a P2P network, relying on a super-peer topology as well as explicit identifiers and indices for schemas, schema attributes and schema types. This work is done in the context of Edutella, a schemabased P2P network based on RDF.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Information Integration in Schema-Based Peer-To-Peer Networks

Peer-to-peer (P2P) networks have become an important infrastructure during the last years. Using P2P networks for distributed information systems allows us to shift the focus from centrally organized to distributed information systems where all peers can provide and have access to information. In previous papers, we have described an RDF-based P2P infrastructure called Edutella which is a speci...

متن کامل

Super-peer-based routing strategies for RDF-based peer-to-peer networks

RDF-based P2P networks have a number of advantages compared to simpler P2P networks such as Napster, Gnutella or to approaches based on distributed indices on binary keys such as CAN and CHORD. RDF-based P2P networks allow complex and extendable descriptions of resources instead of fixed and limited ones, and they provide complex query facilities against these metadata instead of simple keyword...

متن کامل

A Simulation Framework for Schema-Based Query Routing in P2P-Networks

Current simulations of P2P-networks don’t take any kind of schemas into account. We present a simulation-framework and first results for query routing based on extensible schema information to describe peer content, providing more value than simple categorizations like the filename as abstraction for an MP3-song. Using different parameterization, we compare the impact of introducing the HyperCu...

متن کامل

MLCA: A Multi-Level Clustering Algorithm for Routing in Wireless Sensor Networks

Energy constraint is the biggest challenge in wireless sensor networks because the power supply of each sensor node is a battery that is not rechargeable or replaceable due to the applications of these networks. One of the successful methods for saving energy in these networks is clustering. It has caused that cluster-based routing algorithms are successful routing algorithm for these networks....

متن کامل

An Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks

LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002